Constraint Processing in Cc(fd)
نویسندگان
چکیده
Constraint logic programming languages such as CHIP have demonstrated the practicality of declar ative languages supporting consistency techniques and nondeterminism Nevertheless they su er from the black box e ect the programmer must work with a monolithic unmodi able inextensible constraint solver This problem can be overcome within the logically and computationally richer concurrent constraint cc programming paradigm We show that some basic constraint operations currently hardwired into constraint solvers can be abstracted and made available as combinators in the programming language This allows complex constraint solvers to be decomposed into logically clean and e ciently implementable cc programs over a much simpler constraint system In particular we show that the CHIP constraint solver can be simply programmed in cc FD a cc language with an extremely simple built in constraint solver for nite domains
منابع مشابه
Scheduling and Packing in the Constraint Language Cc(fd) Scheduling and Packing in the Constraint Language Cc(fd)
Constraint Logic Programming (CLP), and its generalization in the cc framework, deene a class of declarative constraint languages combining nondeterministic goal-directed programming with constraint techniques over an arbitrary domain. CLP languages are particularly attractive for combinatorial search problems as they ooer a short development time and a reasonable eeciency. In this paper, we pr...
متن کاملDesign,implementations,and Evaluation of the Constraint Language Cc(fd) Design, Implementation, and Evaluation of the Constraint Language Cc(fd)
This paper describes the design, implementation, and applications of the constraint logic language cc(FD). cc(FD) is a declarative nondeterministic constraint logic language over nite domains based on the cc framework 27], an extension of the CLP scheme 16]. Its constraint solver includes (non-linear) arithmetic constraints over natural numbers which are approximated using domain and interval c...
متن کاملDesign, Implementation, and Evaluation of the Constraint Language cc(FD)
. This paper describes the design, implementation, and applications of the constraint logic language cc(FD). cc(FD) is a declarative nondeterministic constraint logic language over nite domains based on the cc framework [33], an extension of the CLP scheme [21]. Its constraint solver includes (non-linear) arithmetic constraints over natural numbers which are approximated using domain and interv...
متن کاملConstraint Satisfaction Using Constraint Logic Programming
Van Hentenryck, P., H. Simonis and M. Dincbas, Constraint satisfaction using constraint logic programming, Artificial Intelligence 58 (1992) 113-159. Constraint logic programming (CLP) is a new class of declarative programming languages whose primitive operations are based on constraints (e.g. constraint solving and constraint entailment). CLP languages naturally combine constraint propagation ...
متن کاملSemantics of Constraint Logic Programs with Bounded Quantifiers
We survey the areas of Constraint programming, Bounded Quanti ers and Collection Types, then we describe an extension of constraint logic programming by bounded quanti ers. Bounded quanti ers provide the support for nite domain constraint programming in a natural way. We de ne several semantics for constraint logic programs with bounded quanti ers and prove their equivalence. Our results can be...
متن کامل